On the numerical solution of a class of systems of linear matrix equations

We consider the solution of systems of linear matrix equations in two or three unknown matrices. For dense problems we derive algorithms that determine the numerical solution by only involving matrices of the same size as those in the original problem, thus requiring low computational resources. For large and structured systems we show how the problem properties can be exploited to design effective algorithms with low memory and operation requirements. Numerical experiments illustrate the performance of the new methods

Stability and noise spectra of relative Loran-C frequency comparisons

Relative comparisons of Loran-C frequency transmissions between the master station of Catanzaro (Simeri Crichi) and the X, Z slave stations of Estartit (Spain) and Lampedusa (Italy) are carrying out by the GG LORSTA monitor station of the Mediterranean Sea Loran-C chain. These comparisons are able to emphasize the relative and, under certain conditions, the absolute rate of the emitting standard frequencies of the slave stations and some relevant statistical properties of the Loran-C Method for frequency transmission and time synchronization. The stability of each Loran-C frequency standard transmission is subject to perturbations, more or less known, due to the propagation medium and other causes. Following the Allan (1966) method for data processing, the performance of the relative rate of frequency of the transmissions of the X, Z slave stations are described calculating the standard deviation of a set of N frequency measurements from its mean averaged during sampling times. This standard deviation is designated as the measure of the stability of the Loran-C frequency transmission

Matrix equation solving of PDEs in polygonal domains using conformal mappings

We explore algebraic strategies for numerically solving linear elliptic partial differential equations in polygonal domains. To discretize the polygon by means of structured meshes, we employ Schwarz-Christoffel conformal mappings, leading to a multiterm linear equation possibly including Hadamard products of some of the terms. This new algebraic formulation allows us to clearly distinguish between the role of the discretized operators and that of the domain meshing. Various algebraic strategies are discussed for the solution of the resulting matrix equation

Functions of rational Krylov space matrices and their decay properties

Rational Krylov subspaces have become a fundamental ingredient in numerical linear algebra methods associated with reduction strategies. Nonetheless, many structural properties of the reduced matrices in these subspaces are not fully understood. We advance in this analysis by deriving bounds on the entries of rational Krylov reduced matrices and of their functions, that ensure an a-priori decay of their entries as we move away from the main diagonal. As opposed to other decay pattern results in the literature, these properties hold in spite of the lack of any banded structure in the considered matrices. Numerical experiments illustrate the quality of our results

Approximating the leading singular triplets of a large matrix function

Given a large square matrix $A$ and a sufficiently regular function $f$ so that $f(A)$ is well defined, we are interested in the approximation of the leading singular values and corresponding singular vectors of $f(A)$, and in particular of $\|f(A)\|$, where $\|\cdot \|$ is the matrix norm induced by the Euclidean vector norm. Since neither $f(A)$ nor $f(A)v$ can be computed exactly, we introduce and analyze an inexact Golub-Kahan-Lanczos bidiagonalization procedure, where the inexactness is related to the inaccuracy of the operations $f(A)v$, $f(A)^*v$. Particular outer and inner stopping criteria are devised so as to cope with the lack of a true residual. Numerical experiments with the new algorithm on typical application problems are reported

The Sherman–Morrison–Woodbury formula for generalized linear matrix equations and applications

We discuss the use of a matrix-oriented approach for numerically solving the dense matrix equation AX + XAT + M1XN1 + … + MℓXNℓ = F, with ℓ ≥ 1, and Mi, Ni, i = 1, …, ℓ of low rank. The approach relies on the Sherman–Morrison–Woodbury formula formally defined in the vectorized form of the problem, but applied in the matrix setting. This allows one to solve medium size dense problems with computational costs and memory requirements dramatically lower than with a Kronecker formulation. Application problems leading to medium size equations of this form are illustrated and the performance of the matrix-oriented method is reported. The application of the procedure as the core step in the solution of the large-scale problem is also shown. In addition, a new explicit method for linear tensor equations is proposed, that uses the discussed matrix equation procedure as a key building block

Inexact Arnoldi residual estimates and decay properties for functions of non-Hermitian matrices

This paper derives a priori residual-type bounds for the Arnoldi approximation of a matrix function together with a strategy for setting the iteration accuracies in the inexact Arnoldi approximation of matrix functions. Such results are based on the decay behavior of the entries of functions of banded matrices. Specifically, a priori decay bounds for the entries of functions of banded non-Hermitian matrices will be exploited, using Faber polynomial approximation. Numerical experiments illustrate the quality of the results

Order reduction approaches for the algebraic Riccati equation and the LQR problem

We explore order reduction techniques for solving the algebraic Riccati equation (ARE), and investigating the numerical solution of the linear-quadratic regulator problem (LQR). A classical approach is to build a surrogate low dimensional model of the dynamical system, for instance by means of balanced truncation, and then solve the corresponding ARE. Alternatively, iterative methods can be used to directly solve the ARE and use its approximate solution to estimate quantities associated with the LQR. We propose a class of Petrov-Galerkin strategies that simultaneously reduce the dynamical system while approximately solving the ARE by projection. This methodology significantly generalizes a recently developed Galerkin method by using a pair of projection spaces, as it is often done in model order reduction of dynamical systems. Numerical experiments illustrate the advantages of the new class of methods over classical approaches when dealing with large matrices

A low-rank matrix equation method for solving PDE-constrained optimization problems

PDE-constrained optimization problems arise in a broad number of applications such as hyperthermia cancer treatment and blood flow simulation. Discretization of the optimization problem and using a Lagrangian approach result in a large-scale saddle-point system, which is challenging to solve, and acquiring a full space-time solution is often infeasible. We present a new framework to efficiently compute a low-rank approximation to the solution by reformulating the KKT system into a Sylvester-like matrix equation. This matrix equation is subsequently projected onto a small subspace via an iterative rational Krylov method, and we obtain a reduced problem by imposing a Galerkin condition on its residual. In our work we discuss implementation details and dependence on the various problem parameters. Numerical experiments illustrate the performance of the new strategy also when compared to other low-rank approaches